compress/flate.tableEntry.offset (field)
144 uses
compress/flate (current package)
deflatefast.go#L139: offset int32
level1.go#L30: v := e.table[i].offset
level1.go#L36: e.table[i].offset = v
level1.go#L79: e.table[nextHash] = tableEntry{offset: s + e.cur}
level1.go#L81: t = candidate.offset - e.cur
level1.go#L83: e.table[nextHash] = tableEntry{offset: nextS + e.cur}
level1.go#L93: e.table[nextHash] = tableEntry{offset: s + e.cur}
level1.go#L95: t = candidate.offset - e.cur
level1.go#L97: e.table[nextHash] = tableEntry{offset: nextS + e.cur}
level1.go#L158: e.table[hashLen(cv, tableBits, hashBytes)] = tableEntry{offset: s + e.cur}
level1.go#L172: e.table[prevHash] = tableEntry{offset: o}
level1.go#L176: e.table[currHash] = tableEntry{offset: o + 2}
level1.go#L178: t = candidate.offset - e.cur
level2.go#L35: v := e.table[i].offset
level2.go#L41: e.table[i].offset = v
level2.go#L83: e.table[nextHash] = tableEntry{offset: s + e.cur}
level2.go#L86: offset := s - (candidate.offset - e.cur)
level2.go#L87: if offset < maxMatchOffset && uint32(cv) == loadLE32(src, candidate.offset-e.cur) {
level2.go#L88: e.table[nextHash] = tableEntry{offset: nextS + e.cur}
level2.go#L98: e.table[nextHash] = tableEntry{offset: s + e.cur}
level2.go#L100: offset = s - (candidate.offset - e.cur)
level2.go#L101: if offset < maxMatchOffset && uint32(cv) == loadLE32(src, candidate.offset-e.cur) {
level2.go#L110: t := candidate.offset - e.cur
level2.go#L138: e.table[hashLen(cv, l2TableBits, hashBytes)] = tableEntry{offset: s + e.cur}
level2.go#L147: e.table[nextHash] = tableEntry{offset: e.cur + i}
level2.go#L151: e.table[nextHash] = tableEntry{offset: e.cur + i + 2}
level2.go#L155: e.table[nextHash] = tableEntry{offset: e.cur + i + 4}
level2.go#L166: e.table[prevHash] = tableEntry{offset: o}
level2.go#L167: e.table[prevHash2] = tableEntry{offset: o + 1}
level2.go#L170: e.table[currHash] = tableEntry{offset: o + 2}
level2.go#L172: offset := s - (candidate.offset - e.cur)
level2.go#L173: if offset > maxMatchOffset || uint32(x>>16) != loadLE32(src, candidate.offset-e.cur) {
level3.go#L38: if v.cur.offset <= minOff {
level3.go#L39: v.cur.offset = 0
level3.go#L41: v.cur.offset = v.cur.offset - e.cur + maxMatchOffset
level3.go#L43: if v.prev.offset <= minOff {
level3.go#L44: v.prev.offset = 0
level3.go#L46: v.prev.offset = v.prev.offset - e.cur + maxMatchOffset
level3.go#L90: e.table[nextHash] = tableEntryPrev{prev: candidates.cur, cur: tableEntry{offset: s + e.cur}}
level3.go#L94: if candidate.offset < minOffset {
level3.go#L100: if uint32(cv) == loadLE32(src, candidate.offset-e.cur) {
level3.go#L101: if candidates.prev.offset < minOffset || uint32(cv) != loadLE32(src, candidates.prev.offset-e.cur) {
level3.go#L105: offset := s - (candidate.offset - e.cur)
level3.go#L106: o2 := s - (candidates.prev.offset - e.cur)
level3.go#L116: if candidate.offset > minOffset && uint32(cv) == loadLE32(src, candidate.offset-e.cur) {
level3.go#L126: t := candidate.offset - e.cur
level3.go#L160: cur: tableEntry{offset: e.cur + t},
level3.go#L171: cur: tableEntry{offset: e.cur + i}}
level3.go#L180: cur: tableEntry{offset: e.cur + s - 2},
level3.go#L187: cur: tableEntry{offset: e.cur + s - 1},
level3.go#L195: cur: tableEntry{offset: s + e.cur},
level3.go#L202: if candidate.offset > minOffset {
level3.go#L203: if uint32(cv) == loadLE32(src, candidate.offset-e.cur) {
level3.go#L208: if candidate.offset > minOffset && uint32(cv) == loadLE32(src, candidate.offset-e.cur) {
level4.go#L31: v := e.table[i].offset
level4.go#L37: e.table[i].offset = v
level4.go#L40: v := e.bTable[i].offset
level4.go#L46: e.bTable[i].offset = v
level4.go#L92: entry := tableEntry{offset: s + e.cur}
level4.go#L96: t = lCandidate.offset - e.cur
level4.go#L102: t = sCandidate.offset - e.cur
level4.go#L108: lOff := lCandidate.offset - e.cur
level4.go#L113: t = lCandidate.offset - e.cur
level4.go#L153: e.table[hashLen(cv, tableBits, hashShortBytes)] = tableEntry{offset: s + e.cur}
level4.go#L154: e.bTable[hashLen(cv, tableBits, hashLongBytes)] = tableEntry{offset: s + e.cur}
level4.go#L163: t := tableEntry{offset: i + e.cur}
level4.go#L164: t2 := tableEntry{offset: t.offset + 1}
level4.go#L172: t := tableEntry{offset: i + e.cur}
level4.go#L173: t2 := tableEntry{offset: t.offset + 1}
level4.go#L186: e.table[prevHashS] = tableEntry{offset: o}
level4.go#L187: e.bTable[prevHashL] = tableEntry{offset: o}
level5.go#L33: v := e.table[i].offset
level5.go#L39: e.table[i].offset = v
level5.go#L43: if v.cur.offset <= minOff {
level5.go#L44: v.cur.offset = 0
level5.go#L45: v.prev.offset = 0
level5.go#L47: v.cur.offset = v.cur.offset - e.cur + maxMatchOffset
level5.go#L48: if v.prev.offset <= minOff {
level5.go#L49: v.prev.offset = 0
level5.go#L51: v.prev.offset = v.prev.offset - e.cur + maxMatchOffset
level5.go#L102: entry := tableEntry{offset: s + e.cur}
level5.go#L110: t = lCandidate.cur.offset - e.cur
level5.go#L114: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L116: eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
level5.go#L118: t2 := lCandidate.prev.offset - e.cur
level5.go#L130: t = lCandidate.prev.offset - e.cur
level5.go#L133: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L135: eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
level5.go#L140: t = sCandidate.offset - e.cur
level5.go#L147: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level5.go#L149: eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
level5.go#L152: t2 := lCandidate.cur.offset - e.cur
level5.go#L164: t2 = lCandidate.prev.offset - e.cur
level5.go#L195: eLong := e.bTable[hashLen(loadLE64(src, sAt), tableBits, hashLongBytes)].cur.offset
level5.go#L238: t := tableEntry{offset: i + e.cur}
level5.go#L245: t = tableEntry{offset: t.offset + 1}
level5.go#L251: t = tableEntry{offset: t.offset + 1}
level5.go#L258: t := tableEntry{offset: i + e.cur}
level5.go#L259: t2 := tableEntry{offset: t.offset + 1}
level5.go#L272: e.table[prevHashS] = tableEntry{offset: o}
level5.go#L274: eLong.cur, eLong.prev = tableEntry{offset: o}, eLong.cur
level6.go#L33: v := e.table[i].offset
level6.go#L39: e.table[i].offset = v
level6.go#L43: if v.cur.offset <= minOff {
level6.go#L44: v.cur.offset = 0
level6.go#L45: v.prev.offset = 0
level6.go#L47: v.cur.offset = v.cur.offset - e.cur + maxMatchOffset
level6.go#L48: if v.prev.offset <= minOff {
level6.go#L49: v.prev.offset = 0
level6.go#L51: v.prev.offset = v.prev.offset - e.cur + maxMatchOffset
level6.go#L101: entry := tableEntry{offset: s + e.cur}
level6.go#L110: t = lCandidate.cur.offset - e.cur
level6.go#L116: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level6.go#L118: eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
level6.go#L121: t2 := lCandidate.prev.offset - e.cur
level6.go#L134: t = lCandidate.prev.offset - e.cur
level6.go#L137: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level6.go#L139: eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
level6.go#L144: t = sCandidate.offset - e.cur
level6.go#L153: e.table[nextHashS] = tableEntry{offset: nextS + e.cur}
level6.go#L155: eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
level6.go#L172: t2 = lCandidate.cur.offset - e.cur
level6.go#L184: t2 = lCandidate.prev.offset - e.cur
level6.go#L217: t2 := eLong.cur.offset - e.cur - l + skipBeginning
level6.go#L229: t2 = eLong.prev.offset - e.cur - l + skipBeginning
level6.go#L267: e.table[hashLen(cv, tableBits, hashShortBytes)] = tableEntry{offset: i + e.cur}
level6.go#L269: eLong.cur, eLong.prev = tableEntry{offset: i + e.cur}, eLong.cur
level6.go#L277: t := tableEntry{offset: i + e.cur}
level6.go#L278: t2 := tableEntry{offset: t.offset + 1}